Recurrence-Driven Summations in Automated Deduction
نویسندگان
چکیده
Abstract Many problems in mathematics and computer science involve summations. We present a procedure that automatically proves equations involving finite summations, inspired by the theory of holonomic sequences. The is designed to be interleaved with activities higher-order automatic theorem prover. It performs an induction solves step, leaving base cases
منابع مشابه
Future directions of automated deduction: Distributed automated deduction
Distributed automated deduction is concerned with the design and realization of strategies where multiple deductive processes work concurrently towards the solution of theorem-proving problems. These strategies are usually implemented in distributed environments, such as a network of computers, or a loosely coupled, asynchronous multiprocessor, where each deductive process runs on a node of the...
متن کاملAutomated Deduction in Real Geometry
Including three aspects, problem solving, theorem proving and theorem discovering, automated deduction in real geometry essentially depends upon the semi-algebraic system solving. A “semi-algebraic system” is a system consisting of polynomial equations, polynomial inequations and polynomial inequalities, where all the polynomials are of integer coefficients. We give three practical algorithms f...
متن کاملDecision Procedures in Automated Deduction
of the Dissertation Decision Procedures in Automated Deduction
متن کاملBDDs and Automated Deduction
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists. We give an overview of BDDs from an automated deduction perspective, showing what can be done with them in propositional and first-order logic, and discuss the parallels to well-known methods like tableaux and resolu...
متن کاملHandling Polymorphism in Automated Deduction
Polymorphism has become a common way of designing short and reusable programs by abstracting generic definitions from typespecific ones. Such a convenience is valuable in logic as well, because it unburdens the specifier from writing redundant declarations of logical symbols. However, top shelf automated theorem provers such as Simplify, Yices or other SMT-LIB ones do not handle polymorphism. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-43369-6_2